Machine Characterization of the Classes of the W-Hierarchy
نویسندگان
چکیده
We give machine characterizations of the complexity classes of the W-hierarchy. Moreover, for every class of this hierarchy, we present a parameterized halting problem complete for this class.
منابع مشابه
The use of analytic hierarchy process in the selection of suitable excavation machine for Dez - Qomroud water conveyance tunnel (lot 1&2), Iran
Qomroud water conveyance tunnel (lot 1&2) with the length of 16 kilometers is considered as one of the greatest development and national projects in Iran. Since about 2 kilometers of tunnel pass through alluvium and the rest of the tunnel pass through various types of geological units, and due to the complexity of geological condition and variety of effective criteria, suitable selection of exc...
متن کاملMachine-based methods in parameterized complexity theory
We give machine characterizations of most parameterized complexity classes, in particular, of W[P], of the classes of the W-hierarchy, and of the A-hierarchy. For example, we characterize W[P] as the class of all parameterized problems decidable by a nondeterministic fixed-parameter tractable algorithm whose number of nondeterministic steps is bounded in terms of the parameter. The machine char...
متن کاملTheories and Proof Systems for PSPACE and the EXP - Time Hierarchy
Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy Alan Ramsay Skelley Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 This dissertation concerns theories of bounded arithmetic and propositional proof systems associated with PSPACE and classes from the exponential-time hierarchy. The second-order viewpoint of Zambella and Cook associates sec...
متن کاملAn Analog Characterization of Elementarily Computable Functions over the Real Numbers
We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we prove that they correspond to the smallest class of functions that contains some basic functions, and closed by composition, linear integration, and a simple limit schema. We generalize this result to all higher levels of the G...
متن کاملThe Boolean Hierarchy over Level 1/2 of the Straubing-Therien Hierarchy
For some fixed alphabet A with jAj 2, a language L A is in the class L1=2 of the Straubing-Thérien hierarchy if and only if it can be expressed as a finite union of languages A a1A a2A A anA , where ai 2 A and n 0. The class L1 is defined as the boolean closure ofL1=2. It is known that the classesL1=2 andL1 are decidable. We give a membership criterion for the single classes of the boolean hier...
متن کامل